(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
f(g(X), Y) → f(X, n__f(n__g(X), activate(Y)))
f(X1, X2) → n__f(X1, X2)
g(X) → n__g(X)
activate(n__f(X1, X2)) → f(activate(X1), X2)
activate(n__g(X)) → g(activate(X))
activate(X) → X
Rewrite Strategy: FULL
(1) RenamingProof (EQUIVALENT transformation)
Renamed function symbols to avoid clashes with predefined symbol.
(2) Obligation:
Runtime Complexity Relative TRS:
The TRS R consists of the following rules:
f(g(X), Y) → f(X, n__f(n__g(X), activate(Y)))
f(X1, X2) → n__f(X1, X2)
g(X) → n__g(X)
activate(n__f(X1, X2)) → f(activate(X1), X2)
activate(n__g(X)) → g(activate(X))
activate(X) → X
S is empty.
Rewrite Strategy: FULL
(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)
Infered types.
(4) Obligation:
TRS:
Rules:
f(g(X), Y) → f(X, n__f(n__g(X), activate(Y)))
f(X1, X2) → n__f(X1, X2)
g(X) → n__g(X)
activate(n__f(X1, X2)) → f(activate(X1), X2)
activate(n__g(X)) → g(activate(X))
activate(X) → X
Types:
f :: n__g:n__f → n__g:n__f → n__g:n__f
g :: n__g:n__f → n__g:n__f
n__f :: n__g:n__f → n__g:n__f → n__g:n__f
n__g :: n__g:n__f → n__g:n__f
activate :: n__g:n__f → n__g:n__f
hole_n__g:n__f1_0 :: n__g:n__f
gen_n__g:n__f2_0 :: Nat → n__g:n__f
(5) OrderProof (LOWER BOUND(ID) transformation)
Heuristically decided to analyse the following defined symbols:
f,
activateThey will be analysed ascendingly in the following order:
f = activate
(6) Obligation:
TRS:
Rules:
f(
g(
X),
Y) →
f(
X,
n__f(
n__g(
X),
activate(
Y)))
f(
X1,
X2) →
n__f(
X1,
X2)
g(
X) →
n__g(
X)
activate(
n__f(
X1,
X2)) →
f(
activate(
X1),
X2)
activate(
n__g(
X)) →
g(
activate(
X))
activate(
X) →
XTypes:
f :: n__g:n__f → n__g:n__f → n__g:n__f
g :: n__g:n__f → n__g:n__f
n__f :: n__g:n__f → n__g:n__f → n__g:n__f
n__g :: n__g:n__f → n__g:n__f
activate :: n__g:n__f → n__g:n__f
hole_n__g:n__f1_0 :: n__g:n__f
gen_n__g:n__f2_0 :: Nat → n__g:n__f
Generator Equations:
gen_n__g:n__f2_0(0) ⇔ hole_n__g:n__f1_0
gen_n__g:n__f2_0(+(x, 1)) ⇔ n__f(gen_n__g:n__f2_0(x), hole_n__g:n__f1_0)
The following defined symbols remain to be analysed:
activate, f
They will be analysed ascendingly in the following order:
f = activate
(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)
Proved the following rewrite lemma:
activate(
gen_n__g:n__f2_0(
+(
1,
n4_0))) →
*3_0, rt ∈ Ω(n4
0)
Induction Base:
activate(gen_n__g:n__f2_0(+(1, 0)))
Induction Step:
activate(gen_n__g:n__f2_0(+(1, +(n4_0, 1)))) →RΩ(1)
f(activate(gen_n__g:n__f2_0(+(1, n4_0))), hole_n__g:n__f1_0) →IH
f(*3_0, hole_n__g:n__f1_0)
We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).
(8) Complex Obligation (BEST)
(9) Obligation:
TRS:
Rules:
f(
g(
X),
Y) →
f(
X,
n__f(
n__g(
X),
activate(
Y)))
f(
X1,
X2) →
n__f(
X1,
X2)
g(
X) →
n__g(
X)
activate(
n__f(
X1,
X2)) →
f(
activate(
X1),
X2)
activate(
n__g(
X)) →
g(
activate(
X))
activate(
X) →
XTypes:
f :: n__g:n__f → n__g:n__f → n__g:n__f
g :: n__g:n__f → n__g:n__f
n__f :: n__g:n__f → n__g:n__f → n__g:n__f
n__g :: n__g:n__f → n__g:n__f
activate :: n__g:n__f → n__g:n__f
hole_n__g:n__f1_0 :: n__g:n__f
gen_n__g:n__f2_0 :: Nat → n__g:n__f
Lemmas:
activate(gen_n__g:n__f2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n40)
Generator Equations:
gen_n__g:n__f2_0(0) ⇔ hole_n__g:n__f1_0
gen_n__g:n__f2_0(+(x, 1)) ⇔ n__f(gen_n__g:n__f2_0(x), hole_n__g:n__f1_0)
The following defined symbols remain to be analysed:
f
They will be analysed ascendingly in the following order:
f = activate
(10) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol f.
(11) Obligation:
TRS:
Rules:
f(
g(
X),
Y) →
f(
X,
n__f(
n__g(
X),
activate(
Y)))
f(
X1,
X2) →
n__f(
X1,
X2)
g(
X) →
n__g(
X)
activate(
n__f(
X1,
X2)) →
f(
activate(
X1),
X2)
activate(
n__g(
X)) →
g(
activate(
X))
activate(
X) →
XTypes:
f :: n__g:n__f → n__g:n__f → n__g:n__f
g :: n__g:n__f → n__g:n__f
n__f :: n__g:n__f → n__g:n__f → n__g:n__f
n__g :: n__g:n__f → n__g:n__f
activate :: n__g:n__f → n__g:n__f
hole_n__g:n__f1_0 :: n__g:n__f
gen_n__g:n__f2_0 :: Nat → n__g:n__f
Lemmas:
activate(gen_n__g:n__f2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n40)
Generator Equations:
gen_n__g:n__f2_0(0) ⇔ hole_n__g:n__f1_0
gen_n__g:n__f2_0(+(x, 1)) ⇔ n__f(gen_n__g:n__f2_0(x), hole_n__g:n__f1_0)
No more defined symbols left to analyse.
(12) LowerBoundsProof (EQUIVALENT transformation)
The lowerbound Ω(n1) was proven with the following lemma:
activate(gen_n__g:n__f2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n40)
(13) BOUNDS(n^1, INF)
(14) Obligation:
TRS:
Rules:
f(
g(
X),
Y) →
f(
X,
n__f(
n__g(
X),
activate(
Y)))
f(
X1,
X2) →
n__f(
X1,
X2)
g(
X) →
n__g(
X)
activate(
n__f(
X1,
X2)) →
f(
activate(
X1),
X2)
activate(
n__g(
X)) →
g(
activate(
X))
activate(
X) →
XTypes:
f :: n__g:n__f → n__g:n__f → n__g:n__f
g :: n__g:n__f → n__g:n__f
n__f :: n__g:n__f → n__g:n__f → n__g:n__f
n__g :: n__g:n__f → n__g:n__f
activate :: n__g:n__f → n__g:n__f
hole_n__g:n__f1_0 :: n__g:n__f
gen_n__g:n__f2_0 :: Nat → n__g:n__f
Lemmas:
activate(gen_n__g:n__f2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n40)
Generator Equations:
gen_n__g:n__f2_0(0) ⇔ hole_n__g:n__f1_0
gen_n__g:n__f2_0(+(x, 1)) ⇔ n__f(gen_n__g:n__f2_0(x), hole_n__g:n__f1_0)
No more defined symbols left to analyse.
(15) LowerBoundsProof (EQUIVALENT transformation)
The lowerbound Ω(n1) was proven with the following lemma:
activate(gen_n__g:n__f2_0(+(1, n4_0))) → *3_0, rt ∈ Ω(n40)
(16) BOUNDS(n^1, INF)